Towards Computing Phase Portraits of Polygonal Differential Inclusions
نویسندگان
چکیده
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we study the problem of defining and constructing the phase portrait of such systems. We identify various important elements of it, such as viability and controllability kernels, and propose an algorithm for computing them all. The algorithm is based on a geometric analysis of trajectories.
منابع مشابه
Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools
Polygonal differential inclusion systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as the computation of certain objects of the phase portrait is decidable. In this paper we show how to compute the viability, controllability and invariance kernels, as well as semi-separatrix curves for...
متن کاملImproving Polygonal Hybrid Systems Reachability Analysis through the use of the Phase Portrait
In this paper we deal with a subclass of planar hybrid automata, denoted by SPDI, which can be represented by piecewise constant differential inclusions. The computation of certain objects of the phase portrait of an SPDI, namely the viability, controllability, invariance kernels and semi-separatrix curves have been shown to be efficiently decidable. On the other hand, although the reachability...
متن کاملInvariance Kernels of Polygonal Differential Inclusions
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we identify and compute an important object of such systems’ phase portrait, namely invariance kernels. An invariant set is a set of initial points of trajectories which keep rotating in a cycle forever and the invariance kernel is the largest of such s...
متن کاملComputing Invariance Kernels of Polygonal Hybrid Systems
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. One way of analysing such systems (and hybrid systems in general) is through the study of their phase portrait, which characterise the systems’ qualitative behaviour. In this paper we identify and compute an important object of polygonal hybrid systems’ phase...
متن کاملModel Checking Polygonal Differential Inclusions Using Invariance Kernels
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we identify and compute an important object of such systems’ phase portrait, namely invariance kernels. An invariant set is a set of initial points of trajectories which keep rotating in a cycle forever and the invariance kernel is the largest of such s...
متن کامل